Перевод: с английского на русский

с русского на английский

С русского на:
Английский
С английского на:
Русский

augmenting path

Толкование Перевод

1 augmenting path

мат. аугментальная цепь (графа)

Большой англо-русский и русско-английский словарь > augmenting path
2 augmenting path

Математика: аугментальная цепь (графа)

Универсальный англо-русский словарь > augmenting path
3 augmenting path

т. граф.

аугментальная цепь (графа)

English-Russian scientific dictionary > augmenting path
4 flow augmenting path

Математика: путь, увеличивающий поток

Универсальный англо-русский словарь > flow augmenting path
5 flow augmenting path

т. граф. путь, увеличивающий поток

English-Russian scientific dictionary > flow augmenting path
6 path

1) путь; трасса

2) траектория

3) канал; тракт

4) дорожка ( магнитной ленты)

5) вчт ветвь (программы)

6) цепь ( в электрической схеме)

7) путь доступа

8) контур

•

path traveled — пройденный путь

to move in a path — двигаться по траектории

to trace around a path — совершать обход контура

- actual path

- admissible path

- alternating path

- anode-cathode path

- approach path

- arcover path

- asymptotic path

- augmenting path

- auxiliary path

- balanced growth path

- boost path

- boundary path

- bounded path

- cathode-grid path

- chance path

- circular path

- circulation path of vessel

- closed path

- coarse path

- coasting path

- combinatorial path

- complete path

- composite path

- connected path

- connecting path

- constant path

- continuous path

- covering path

- critical path

- crooked path

- cross path

- cruise path

- curved path

- cyclic path

- deficiency path

- diametral path

- directed path

- discharge path

- disconnected path

- disorienting path

- divergent path

- drainage path

- edge path

- electroacoustic receiving path

- elementary path

- empty path

- ergodic path

- external path

- extremal path

- finite path

- flight path

- flow augmenting path

- flue gas path

- flying path

- forward path of graph

- forward path

- four-dimensional path

- fractional path

- freewheel current path

- generalized path

- geodesic path

- growth path

- helical path

- homoclinic path

- hyperbolic path

- identity path

- internal path

- inverse path

- inversion path

- labeled path

- landing path

- lattice path

- leakage path

- least-time path

- limit path

- linear path

- longest path

- mean free path

- minimax path

- minimum path

- monotonic boundary path

- negative path

- net flight path

- nominal path

- noncritical path

- non-tangential path

- nontangential path

- null path

- null-homotopic path

- open path

- opposite path

- optimal path

- orbital path

- oriented path

- path of a process
- path of a projectile
- path of integration

- path of motion

- path of steepest ascent

- path of winding

- periodic path

- phase path

- polar path

- polygonal path

- positive path

- principal path

- pursuit path

- radiation path

- radio path

- random path

- ray path

- reciprocal path

- rectifiable path

- reduced path

- reducible path

- reflected path

- sample path

- search path

- shifted path

- shortest path

- signal path

- sneak path

- spiral path

- stopped path

- subcritical path

- takeoff path

- talking path

- through path

- topologically allowed path

- translated path

- transmission path

- trivial path

- truncated path

- unicursal path

- universally simple path

- unsaturated path

- vortex path

English-Russian scientific dictionary > path
7 augmenting

матем. пополняющий flow augmenting algorithm ≈ алгоритм поиска увеличивающей поток цепи flow augmenting path ≈ путь, увеличивающий поток - augmenting chain - augmenting path - augmenting tree
Увеличение

Большой англо-русский и русско-английский словарь > augmenting
8 аугментальная цепь

мат. augmenting path

Большой англо-русский и русско-английский словарь > аугментальная цепь
9 tree

1) дерево, древо || засаживать деревьями

2) древовидная схема; древовидная структура

3) т. граф. дерево

4) pl дендритные образования на катоде ( при электроосаждении металлов)

tree from point — дерево из точки

tree with labeled nodes — дерево с помеченными вершинами

tree with ordered vertices — дерево с упорядоченными вершинами

to transport felled trees — трелевать заготовленный лес

- acyclic tree

- alternating tree

- arithmetical tree

- augmenting tree

- auxiliary tree

- balanced tree

- bicentral tree

- bicentroidal tree

- bichromatic tree

- bifurcating tree

- binary tree

- blossomed tree

- branch of tree

- branch tree

- broad-leaved tree

- bushy tree

- Cayley tree

- choice tree

- closed tree

- cluster tree

- code tree

- colored tree

- compact tree

- complete tree

- completely balanced tree

- computable tree

- computation tree

- concave tree

- continuous tree

- cospectral tree

- countable tree

- crop tree

- decision tree

- decomposition tree

- deduction tree

- degenerated tree

- depth-balanced tree

- derivation tree

- diagnostic tree

- directed tree

- dominator tree

- dual tree

- economy tree

- edge-rooted tree

- empty tree

- explicite tree

- extended tree

- family tree

- finite rooted directed tree

- finite tree

- finite-path tree

- flexible tree

- flowered tree

- folded tree

- formulation tree

- free tree

- full tree

- function tree

- generalized tree

- generation tree

- hierarchical tree

- homeomorphically irreducible tree

- identity tree

- implicite tree

- inference tree

- infinite tree

- inverted tree

- isometric tree

- labeled tree

- language tree

- late binding tree

- left-threaded tree

- line-rooted tree

- logical tree

- mast tree

- maximal tree

- minimal spanning tree

- minimal tree

- mission outcome tree
- mixed star tree
- monotonic tree

- m-tier tree

- multibranch tree

- multiway tree

- n-ary tree

- n-dimensional tree

- neighboring trees

- nonbinary tree

- nonisomorphic tree

- normal tree

- null tree

- number tree

- one-level tree

- optimal solution tree

- optimum tree

- ordered tree

- oriented tree

- parametric tree

- parsing tree

- partition of tree

- periodic tree

- pitch-yielding tree

- planar tree
- plane tree
- planted tree

- potential solution tree

- prefix tree

- probability tree

- production tree

- prognostic tree

- projective tree

- prolific tree

- proof tree

- pseudosemantic tree

- quotient tree

- radix tree

- random tree

- recursive tree

- reduced tree

- refutation tree

- regular tree

- relevance tree

- response tree

- right-threaded tree

- rubber tree

- search tree

- semiinfinite tree

- sequential tree

- set tree

- shallow tree

- shortest spanning tree

- shortest tree

- shortest-distance tree

- signed tree

- sink tree

- smooth tree

- solution tree

- sorting tree

- spanning tree

- spar tree

- spectrum tree

- split tree

- star tree

- strongly recursive tree

- stunted tree

- subspanning tree

- successor tree

- suppressed tree

- symmetric tree

- syntax tree

- ternary tree

- timber tree

- topological tree

- transition tree

- tree of objectives

- tree of statements

- trivalent tree

- trivial tree

- two-colored tree

- two-dimensional tree

- two-level tree

- undirected tree

- unlabeled tree

- unrooted tree

- upside down tree

- utility tree

- wayside trees

- weight-balanced trees

- weighted tree

- well-founded tree

English-Russian scientific dictionary > tree

См. также в других словарях:

Neuroevolution of augmenting topologies — (NEAT) is a genetic algorithm for the generation of evolving artificial neural networks (a neuroevolution technique) developed by Ken Stanley in 2002 while at The University of Texas at Austin. It alters both the weighting parameters and… … Wikipedia
Hopcroft–Karp algorithm — The Hopcroft–Karp algorithm finds maximum cardinality matchings in bipartite graphs in O(sqrt{V} E) time, where V is the number of vertices and E is the number of edges of the graph. [John E. Hopcroft, Richard M. Karp: An n^{5/2} Algorithm for… … Wikipedia
Claw-free graph — A claw In graph theory, an area of mathematics, a claw free graph is a graph that does not have a claw as an induced subgraph. A claw is another name for the complete bipartite graph K1,3 (that is, a star graph with three edges, three leaves, and … Wikipedia
Dinic's algorithm — is a strongly polynomial algorithm for computing the maximum flow in a flow network, conceived in 1970 by Israeli (formerly Soviet) computer scientist Yefim Dinitz. The algorithm runs in O(V2E) time and is similar to the Edmonds–Karp algorithm,… … Wikipedia
Matching (graph theory) — In the mathematical discipline of graph theory, a matching or independent edge set in a graph is a set of edges without common vertices. It may also be an entire graph consisting of edges without common vertices. Covering packing dualities… … Wikipedia
Edmonds-Karp algorithm — In computer science and graph theory, the Edmonds Karp algorithm is an implementation of the Ford Fulkerson method for computing the maximum flow in a flow network in mathcal{O}(|V| cdot |E|^2). It is asymptotically slower than the relabel to… … Wikipedia
Ford-Fulkerson algorithm — The Ford Fulkerson algorithm (named for L. R. Ford, Jr. and D. R. Fulkerson) computes the maximum flow in a flow network. It was published in 1956. The name Ford Fulkerson is often also used for the Edmonds Karp algorithm, which is a… … Wikipedia
Maximum flow problem — An example of a flow network with a maximum flow. The source is s, and the sink t. The numbers denote flow and capacity. In optimization theory, the maximum flow problem is to find a feasible flow through a single source, single sink flow network … Wikipedia
Flow network — In graph theory, a flow network is a directed graph where each edge has a capacity and each edge receives a flow. The amount of flow on an edge cannot exceed the capacity of the edge. Often in Operations Research, a directed graph is called a… … Wikipedia
List of terms relating to algorithms and data structures — The [http://www.nist.gov/dads/ NIST Dictionary of Algorithms and Data Structures] is a reference work maintained by the U.S. National Institute of Standards and Technology. It defines a large number of terms relating to algorithms and data… … Wikipedia
Список терминов, относящихся к алгоритмам и структурам данных — Это служебный список статей, созданный для координации работ по развитию темы. Данное предупреждение не устанавливается на информационные списки и глоссарии … Википедия

Словари и энциклопедии на Академике

Перевод: с английского на русский

augmenting path

См. также в других словарях:

Поделиться ссылкой на выделенное

Словари и энциклопедии на Академике

Перевод: с английского на русский

augmenting path

См. также в других словарях:

Поделиться ссылкой на выделенное

Прямая ссылка: